Duplication self vertex switchings in self centered graphs
نویسندگان
چکیده
منابع مشابه
Self-Complementary Vertex-Transitive Graphs
A graph Γ is self-complementary if its complement is isomorphic to the graph itself. An isomorphism that maps Γ to its complement Γ is called a complementing isomorphism. The majority of this dissertation is intended to present my research results on the study of self-complementary vertex-transitive graphs. I will provide an introductory mini-course for the backgrounds, and then discuss four pr...
متن کاملSelf Vertex Switching of Connected Bicyclic Graphs
-A vertex v V(G) is said to be a self vertex switching of G if G is isomorphic to G v , where G v is the graph obtained from G by deleting all edges of G incident to v and adding all edges incident to v which are not in G. In [5], trees and forests are characterized, each with a self vertex switching. In [6], connected unicyclic graphs, each with a self vertex switching are characterized. In th...
متن کاملSome Notes on Minimal Self–Centered Graphs
A graph is called self–centered if all of its vertices have the same eccentricity. We prove some new properties of such graphs and obtain all minimal self–centered graphs of up to 10 vertices.
متن کاملAlmost Self-centered Median and Chordal Graphs
Almost self-centered graphs were recently introduced as the graphs with exactly two non-central vertices. In this paper we characterize almost selfcentered graphs among median graphs and among chordal graphs. In the first case P4 and the graphs obtained from hypercubes by attaching to them a single leaf are the only such graphs. Among chordal graph the variety of almost self-centered graph is m...
متن کاملA characterization for 2-self-centered graphs
A Graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their compliments. Then we split characterizing edge-minimal 2-self-centered graphs into two cases. First, we characterize edge-minimal 2-self-centered graphs without triangles by introducing intersecting bi-i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2020
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0s20/0106